New Stopping Criteria for Segmenting DNA Sequences
نویسندگان
چکیده
منابع مشابه
New stopping criteria for segmenting DNA sequences.
We propose a solution on the stopping criterion in segmenting inhomogeneous DNA sequences with complex statistical patterns. This new stopping criterion is based on Bayesian information criterion in the model selection framework. When this criterion is applied to telomere of S. cerevisiae and the complete sequence of E. coli, borders of biologically meaningful units were identified, and a more ...
متن کاملNew stopping criteria for iterative root finding
A set of simple stopping criteria is presented, which improve the efficiency of iterative root finding by terminating the iterations immediately when no further improvement of the roots is possible. The criteria use only the function evaluations already needed by the root finding procedure to which they are applied. The improved efficiency is achieved by formulating the stopping criteria in ter...
متن کاملMOSAIC: segmenting multiple aligned DNA sequences
UNLABELLED MOSAIC is a set of tools for the segmentation of multiple aligned DNA sequences into homogeneous zones. The segmentation is based on the distribution of mutational events along the alignment. As an example, the analysis of one repeated sequence belonging to the subtelomeric regions of the yeast genome is presented. AVAILABILITY Free access from ftp://ftp.biomath.jussieu.fr/pub/pape...
متن کاملStopping Criteria for SVMs
The support vector machine has been shown to be comparable to the state of the art for classification. In certain situations however, the convergence to a global optimum of the optimization problem can be very slow. It is shown that solutions suboptimal in terms of the optimization problem can still have very good performance. By using a heuristic stopping criterion (termed HERMES) these soluti...
متن کاملNew stopping criteria for detecting infeasibility in conic optimization
Detecting infeasibility in conic optimization and providing certificates for infeasibility pose a bigger challenge than in the linear case due to the lack of strong duality. In this paper we generalize the approximate Farkas lemma of Todd and Ye [12] from the linear to the general conic setting, and use it to propose stopping criteria for interior point algorithms using self-dual embedding. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2001
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.86.5815